Modular Answer Set Solving
نویسندگان
چکیده
Modularity is essential for modeling large-scale practical applications. We propose modular logic programs as a modular version of answer set programming and study the relationship of our formalism to an earlier concept
منابع مشابه
Modular Construction of Ground Logic Programs
In this paper, we view declarative problem solving from the perspective of answer set programming (ASP). The idea is to solve any given problem by formalizing it as a logic program whose answer sets capture the solutions of the problem. In practice such sets are computed using a special-purpose search engine, viz. an answer set solver, and a ground program obtained by instantiating term variabl...
متن کاملMacros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
Currently, most knowledge representation using logic programming with answer set semantics (AnsProlog) is ‘flat’. In this paper we elaborate on our thoughts about a modular structure for knowledge representation and declarative problem solving formalism using AnsProlog. We present language constructs that allow defining of modules and calling of such modules from programs. This allows one to wr...
متن کاملSolving Modular Model Expansion: Case Studies
Model expansion task is the task representing the essence of search problems where we are given an instance of a problem and are searching for a solution satisfying certain properties. Such tasks are common in AI planning, scheduling, logistics, supply chain management, etc., and are inherently modular. Recently, the model expansion framework was extended to deal with multiple modules to repres...
متن کاملAlternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one hand, concepts like loops and elementary sets have been proposed in order to extend Clark’s completion for computing answer sets of logic programs by means of propositional logic. On the other hand, different concepts...
متن کاملAlternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one hand, concepts like loops and elementary sets have been proposed in order to extend Clark’s completion for computing answer sets of logic programs by means of propositional logic. On the other hand, different concepts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013